51![XX ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages MATTEO RIONDATO, Two Sigma Investments, LP ELI UPFAL, Brown University XX ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages MATTEO RIONDATO, Two Sigma Investments, LP ELI UPFAL, Brown University](https://www.pdfsearch.io/img/ad2f98af3063d93d2c772b085d38a78f.jpg) | Add to Reading ListSource URL: matteo.rionda.toLanguage: English - Date: 2016-07-30 12:22:15
|
---|
52![Local optimality in algebraic path problems (with help from Coq and Ssreflect) Timothy G. Griffin Computer Laboratory University of Cambridge, UK Local optimality in algebraic path problems (with help from Coq and Ssreflect) Timothy G. Griffin Computer Laboratory University of Cambridge, UK](https://www.pdfsearch.io/img/4fbebc76a8ad9aa7b3540c3901183d32.jpg) | Add to Reading ListSource URL: www.monmeetings.orgLanguage: English - Date: 2015-09-04 10:24:56
|
---|
53![IntelliDroid: A Targeted Input Generator for the Dynamic Analysis of Android Malware Michelle Y. Wong and David Lie Department of Electrical and Computer Engineering University of Toronto IntelliDroid: A Targeted Input Generator for the Dynamic Analysis of Android Malware Michelle Y. Wong and David Lie Department of Electrical and Computer Engineering University of Toronto](https://www.pdfsearch.io/img/1153916f753de774dcd9bab96eccc7e1.jpg) | Add to Reading ListSource URL: www.eecg.toronto.eduLanguage: English - Date: 2015-12-20 13:29:40
|
---|
54![Adaptive Collective Routing Using Gaussian Process Dynamic Congestion Models Siyuan Liu, Yisong Yue, Ramayya Krishnan Carnegie Mellon University {siyuan,yisongyue,rk2x}@cmu.edu Adaptive Collective Routing Using Gaussian Process Dynamic Congestion Models Siyuan Liu, Yisong Yue, Ramayya Krishnan Carnegie Mellon University {siyuan,yisongyue,rk2x}@cmu.edu](https://www.pdfsearch.io/img/1f7a0837f91f37fe6d2a2eefdadd0f92.jpg) | Add to Reading ListSource URL: www.utc.ices.cmu.eduLanguage: English - Date: 2014-10-10 12:11:58
|
---|
55![Online Multi-dimensional Dynamic Bin Packing of Unit-Fraction Items Mihai Burcea⋆ , Prudence W.H. Wong, and Fencol C.C. Yung Department of Computer Science, University of Liverpool, UK {m.burcea,pwong}@liverpool.ac.uk, Online Multi-dimensional Dynamic Bin Packing of Unit-Fraction Items Mihai Burcea⋆ , Prudence W.H. Wong, and Fencol C.C. Yung Department of Computer Science, University of Liverpool, UK {m.burcea,pwong}@liverpool.ac.uk,](https://www.pdfsearch.io/img/6da2b7669d768b366ae7f71ae84d5cef.jpg) | Add to Reading ListSource URL: cgi.csc.liv.ac.ukLanguage: English - Date: 2013-01-24 10:01:00
|
---|
56![COMPUTING SHORTEST PATHS USING SPARSE GAUSSIAN ELIMINATION Aydın Bulu¸c, John Gilbert, Sivan Toledo SIAM Workshop on Network Science 2014 July 6-7 · Chicago For example, U ∗ encodes the paths from lower numbered COMPUTING SHORTEST PATHS USING SPARSE GAUSSIAN ELIMINATION Aydın Bulu¸c, John Gilbert, Sivan Toledo SIAM Workshop on Network Science 2014 July 6-7 · Chicago For example, U ∗ encodes the paths from lower numbered](https://www.pdfsearch.io/img/c45058d0b60aa7b5d38457c21ae4091b.jpg) | Add to Reading ListSource URL: siam.orgLanguage: English - Date: 2014-06-30 13:57:26
|
---|
57![A = a x aa m if and only if there is a mapping F: {1, 2, . . . , p} ~ {1, 2, . . . , m} such that f(i) = k only if c~ is ak and F is a m o n o t o n e strictly increasing function (i.e. F(i) = u, F ( j ) = v, a A = a x aa m if and only if there is a mapping F: {1, 2, . . . , p} ~ {1, 2, . . . , m} such that f(i) = k only if c~ is ak and F is a m o n o t o n e strictly increasing function (i.e. F(i) = u, F ( j ) = v, a](https://www.pdfsearch.io/img/6bb6ec0c56087b0b00a3bce87dd2dece.jpg) | Add to Reading ListSource URL: bioinfo.ict.ac.cnLanguage: English - Date: 2014-11-28 11:05:21
|
---|
58![Competitive Multi-Dimensional Dynamic Bin Packing via L-Shape Bin Packing ⋆ Prudence W.H. Wong and Fencol C.C. Yung Competitive Multi-Dimensional Dynamic Bin Packing via L-Shape Bin Packing ⋆ Prudence W.H. Wong and Fencol C.C. Yung](https://www.pdfsearch.io/img/c7babfe2d35d975a164c993144131d3f.jpg) | Add to Reading ListSource URL: cgi.csc.liv.ac.ukLanguage: English - Date: 2009-10-29 07:57:39
|
---|
59![Solving Dynamic Constraint Satisfaction Problems: Relations between Problem Alteration and Search Performance Richard J. Wallace, Diarmuid Grimes and Eugene C. Freuder Cork Constraint Computation Centre and Department of Solving Dynamic Constraint Satisfaction Problems: Relations between Problem Alteration and Search Performance Richard J. Wallace, Diarmuid Grimes and Eugene C. Freuder Cork Constraint Computation Centre and Department of](https://www.pdfsearch.io/img/b519b3472a9ee96aa09e884c47fb4286.jpg) | Add to Reading ListSource URL: tmancini.di.uniroma1.itLanguage: English - Date: 2008-12-16 11:07:53
|
---|
60![Revenue Maximization in the Dynamic Knapsack Problem Deniz Dizdar, Alex Gershkov and Benny MoldovanuAbstract Revenue Maximization in the Dynamic Knapsack Problem Deniz Dizdar, Alex Gershkov and Benny MoldovanuAbstract](https://www.pdfsearch.io/img/40fe242d62152a4846df4b9b1e306b2e.jpg) | Add to Reading ListSource URL: pluto.huji.ac.ilLanguage: English - Date: 2014-02-02 05:15:06
|
---|